Allometric relationships between traveltime channel networks, convex hulls, and convexity measures

نویسندگان

  • Lea Tien Tay
  • B. S. Daya Sagar
  • Hean Teik Chuah
چکیده

[1] The channel network (S) is a nonconvex set, while its basin [C(S)] is convex. We remove open-end points of the channel connectivity network iteratively to generate a traveltime sequence of networks (Sn). The convex hulls of these traveltime networks provide an interesting topological quantity, which has not been noted thus far. We compute lengths of shrinking traveltime networks L(Sn) and areas of corresponding convex hulls C(Sn), the ratios of which provide convexity measures CM(Sn) of traveltime networks. A statistically significant scaling relationship is found for a model network in the form L(Sn) A[C(Sn)]. From the plots of the lengths of these traveltime networks and the areas of their corresponding convex hulls as functions of convexity measures, new power law relations are derived. Such relations for a model network are

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morphological convexity measures for terrestrial basins derived from digital elevation models

Geophysical basins of terrestrial surfaces have been quantitatively characterized through a host of indices such as topological quantities (e.g. channel bifurcation and length ratios), allometric scaling exponents (e.g. fractal dimensions), and other geomorphometric parameters (channel density, Hack’s and Hurst exponents). Channel density, estimated by taking the ratio between the length of cha...

متن کامل

Canonical and monophonic convexities in hypergraphs

Known properties of ‘‘canonical connections’’ from database theory and of ‘‘closed sets’’ from statistics implicitly define a hypergraph convexity, here called canonical convexity (cconvexity), and provide an efficient algorithm to compute c-convex hulls. We characterize the class of hypergraphs in which c-convexity enjoys the Minkowski–Krein–Milman property. Moreover, we compare c-convexity wi...

متن کامل

Cloud field segmentation via multiscale convexity analysis

[1] Cloud fields retrieved from remotely sensed satellite data resemble functions depicting spectral values at each spatial position (x,y). Segmenting such cloud fields through a simple thresholding technique may not provide any structurally significant information about each segmented category. An approach based on the use of multiscale convexity analysis to derive structurally significant reg...

متن کامل

A Convexity Measure for Open and Closed Contours

Convexity represents a fundamental descriptor of object shape. This paper presents a new convexity measure for both open and closed simple contours. Given such a contour this measure extracts two corresponding open convex hulls. The shape similarity between these two hulls and the original contour is then computed and normalized to give a measure of convexity. The time complexity of the propose...

متن کامل

Contemporary Mathematics Bounds on the Non-convexity of Ranges of Vector Measures with Atoms

Upper bounds are given for the distance between the range, matrix range and partition range of a vector measure to the respective convex hulls of these ranges. The bounds are speciied in terms of the maximum atom size, and generalize convexity results of Lyapounov (1940) and Dvoretzky, Wald and Wolfowitz (1951). Applications are given to the bisection problem, the "problem of the Nile", and fai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006